Prioritized customer order scheduling to maximize throughput
نویسندگان
چکیده
منابع مشابه
Online Scheduling of Bounded Length Jobs to Maximize Throughput
We consider an online scheduling problem, motivated by the following online auction setting. A non-storable perishable good is produced at a regular rate. It has to be sold immediately to customers whose offers arrive on-line. More formally, we consider the online scheduling problem with preemptions, where each job j is revealed at release time rj , has processing time pj , deadline dj and weig...
متن کاملA Note on Scheduling Equal-Length Jobs to Maximize Throughput
We study the problem of scheduling equal-length jobs with release times and deadlines, where the objective is to maximize the number of completed jobs. Preemptions are not allowed. In Graham’s notation, the problem is described as 1|rj ; pj = p| ∑ Uj. We give the following results: (1) We show that the often cited algorithm by Carlier from 1981 is not correct. (2) We give an algorithm for this ...
متن کاملPreemptive scheduling of equal-length jobs to maximize weighted throughput
We study the problem of computing a preemptive schedule of equal-length jobs with given release times and deadlines. Each job is assigned a weight, and our goal is to maximize the weighted throughput, which is the total weight of completed jobs. In Graham’s notation this problem is described as (1|rj ; pj=p; pmtn| ∑ wjUj). We provide an O(n )-time algorithm for this problem, improving the previ...
متن کاملScheduling to Maximize Participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in order to get serviced provided that her latency requirement is met or not to participate in the assignment at all. From a global perspective, in order to optimize the performance of such a system, one would aim to max...
متن کاملCustomer Order Scheduling to Minimize Total Weighted Completion Time
In this paper we study the scheduling problem in which each customer order consists of several jobs of different types, which are to be processed on m facilities. Each facility is dedicated to the processing of only one type of jobs. All jobs of an order have to be delivered to the customer at the same time. The objective is to schedule all the orders to minimize the total weighted order comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2016
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2016.05.066